Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
نویسندگان
چکیده
Minimum spanning tree is a minimum-cost spanning tree connecting the whole network, but it couldn't be directly obtained on uncertain graph. In this paper, we define the reliability as the existence probability of all minimum spanning trees and present an algorithm for evaluating reliability of the minimum spanning tree on uncertain graph. The time complexity of the algorithm is O(Nmn), where n, m and N stand for the number of vertices, edges and minimum spanning trees, respectively. Because this algorithm spends more time finding minimum spanning tree, we propose an improved algorithm whose time complexity is O(Nm). The improved algorithm uses disjoint set data structure so that the average time complexity on finding a new minimum spanning tree is O(m/n). The two algorithms are analyzed in detail and the experiment results agree with theoretical analysis.
منابع مشابه
Providing a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کاملUncertain Quadratic Minimum Spanning Tree Problem
The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables. The notion of the uncertain quadratic -minimum spanning tree is introduced by using the uncertain chance co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 10 شماره
صفحات -
تاریخ انتشار 2015